End-to-End Camera Calibration for Broadcast Video

ABSTRACT

A system and method of calibrating a broadcast video feed are disclosed herein. A computing system retrieves a plurality of broadcast video feeds that include a plurality of video frames. The computing system generates a trained neural network, by generating a plurality of training data sets based on the broadcast video feed and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames. The computing system receives a target broadcast video feed for a target sporting event. The computing system partitions the target broadcast video feed into a plurality of target frames. The computing system generates for each target frame in the plurality of target frames, via the neural network, a target homography matrix. The computing system calibrates the target broadcast video feed by warping each target frame by a respective target homography matrix.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Application Ser. No. 63/008,184, filed Apr. 10, 2020, which is hereby incorporated by reference in its entirety.

FIELD OF THE DISCLOSURE

The present disclosure generally relates to system and method for end-to-end camera calibration for broadcast video actions and actors, based on, for example, tracking data.

BACKGROUND

The increasing number of vision-based tracking systems deployed in production have necessitated fast, robust camera calibration. In the domain of sport, for example, the majority of current work focuses on sports where lines and intersections are easy to extract, and appearance is relatively consistent across venues.

SUMMARY

In some embodiments, a method of calibrating a broadcast video feed is disclosed herein. A computing system retrieves a plurality of broadcast video feeds for a plurality of sporting events. Each broadcast video feed includes a plurality of video frames. The computing system generates a trained neural network, by generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames. The computing system receives a target broadcast video feed for a target sporting event. The computing system partitions the target broadcast video feed into a plurality of target frames. The computing system generates for each target frame in the plurality of target frames, via the neural network, a target homography matrix. The computing system calibrates the target broadcast video feed by warping each target frame by a respective target homography matrix.

In some embodiments, a system is disclosed herein. The system includes a processor and a memory. The memory has programming instructions stored thereon, which, when executed by the processor, performs one or more operations. The one or more operations include retrieving a plurality of broadcast video feeds for a plurality of sporting event. Each broadcast video feed includes a plurality of video frames. The one or more operation further include generating a trained neural network, by generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames. the one or more operations further include receiving a target broadcast video feed for a target sporting event. The one or more operations further include partitioning the target broadcast video feed into a plurality of target frames. the one or more operations further include for each target frame in the plurality of target frames, generating, by the neural network, a target homography matrix. The one or more operations further include calibrating the target broadcast video feed by warping each target frame by a respective target homography matrix.

In some embodiments, a non-transitory computer readable medium is disclosed herein. The non-transitory computer readable medium includes one or more sequences of instructions that, when executed by one or more processors, causes a computing system to perform one or more operations. The computing system retrieves a plurality of broadcast video feeds for a plurality of sporting events. Each broadcast video feed includes a plurality of video frames. The computing system generates a trained neural network, by generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames. The computing system receives a target broadcast video feed for a target sporting event. The computing system partitions the target broadcast video feed into a plurality of target frames. The computing system generates for each target frame in the plurality of target frames, via the neural network, a target homography matrix. The computing system calibrates the target broadcast video feed by warping each target frame by a respective target homography matrix.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the present disclosure can be understood in detail, a more particular description of the disclosure, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrated only typical embodiments of this disclosure and are therefore not to be considered limiting of its scope, for the disclosure may admit to other equally effective embodiments.

FIG. 1 is a block diagram illustrating a computing environment, according to example embodiments.

FIGS. 2A-2B are a block diagrams illustrating a neural network architecture of camera calibrator, according to example embodiments.

FIG. 3 is a block diagram illustrating one or more images of a playing surface, according to example embodiments.

FIG. 4 is a flow diagram illustrating a method of generating a fully trained calibration model, according to example embodiments.

FIG. 5 is a flow diagram illustrating a method of calibrating a broadcast camera, according to example embodiments.

FIG. 6A is a block diagram illustrating a computing device, according to example embodiments.

FIG. 6B is a block diagram illustrating a computing device, according to example embodiments.

To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. It is contemplated that elements disclosed in one embodiment may be beneficially utilized on other embodiments without specific recitation.

DETAILED DESCRIPTION

Camera calibration is an important task for computer vision applications, such as tracking systems, simultaneous localization and mapping (SLAM), and augmented reality (AR). Recently, many professional sports leagues have deployed some version of a vision-based tracking system. Additionally, AR applications (e.g., Virtual 3 in NBA®, First Down Line in NFL®) used during video broadcasts to enhance audience's engagement have become commonplace. All of these applications require high-quality camera calibration systems. Presently, most of these applications rely on multiple pre-calibrated fixed cameras or the real-time feed of pan-tilt-zoom (PTZ) parameters directly from the camera. However, as the most widely available data source in the sports domain is broadcast videos, the ability to calibrate from a single, moving camera with unknown and changing camera parameters would greatly expand the reach of player tracking data and fan-engagement solutions. Calibration of a single moving camera remains a challenging task as the approach should be accurate, fast, and generalizable to a variety of views and appearances. The one or more techniques described herein allows for a computing system to determine camera homography of a single moving camera given the frame and the sport.

Current approaches to camera calibration mainly follow a framework based on field registration, template matching (i.e., camera pose initialization), and homography refinement. Most of these approaches focus on sports where semantic information (e.g., key court markings) is easy to extract, the field appearance is consistent across stadiums (e.g., green grass and white lines), and motion of the camera is relatively slow and smooth. These assumptions, however, do not hold in more dynamic sports, such as basketball, where players occlude field markings, the field appearance varies wildly from venue to venue, and the camera moves quickly.

Furthermore, most existing works consist of multiple standalone models that are trained or tuned separately. As a result, they cannot achieve a global optimal for such an optimization task. This issue further limits the performance of those methods in more challenging scenarios as error propagates through the system, module to module.

The one or more techniques described herein relate to a brand new end-to-end neural network used for camera calibration. Through use of the end-to-end neural network, the present system is able to handle more challenging scenarios involving motion blur, occlusion and large transformations—scenarios existing systems are simply unable to account for or address. In some embodiments, the present system implements area-based semantics rather than lines for camera calibration, thus providing a more robust approach for dynamic environments and those environments with highly variable appearance features. In some embodiments, the present system incorporates a spatial transformation network for large transform learning, which aids in reducing the number of required templates for calibration purposes. In some embodiments, the present system implements an end-to-end architecture for camera calibration, which allow for joint training and inference homography much more efficiently.

FIG. 1 is a block diagram illustrating a computing environment 100, according to example embodiments. Computing environment 100 may include camera system 102, organization computing system 104, and one or more client devices 108 communicating via network 105.

Network 105 may be of any suitable type, including individual connections via the Internet, such as cellular or Wi-Fi networks. In some embodiments, network 105 may connect terminals, services, and mobile devices using direct connections, such as radio frequency identification (RFID), near-field communication (NFC), Bluetooth™, low-energy Bluetooth™ (BLE), Wi-Fi™ ZigBee™, ambient backscatter communication (ABC) protocols, USB, WAN, or LAN. Because the information transmitted may be personal or confidential, security concerns may dictate one or more of these types of connection be encrypted or otherwise secured. In some embodiments, however, the information being transmitted may be less personal, and therefore, the network connections may be selected for convenience over security.

Network 105 may include any type of computer networking arrangement used to exchange data or information. For example, network 105 may be the Internet, a private data network, virtual private network using a public network and/or other suitable connection(s) that enables components in computing environment 100 to send and receive information between the components of environment 100.

Camera system 102 may be positioned in a venue 106. For example, venue 106 may be configured to host a sporting event that includes one or more agents 112. Camera system 102 may be configured to capture the motions of all agents (i.e., players) on the playing surface, as well as one or more other objects of relevance (e.g., ball, referees, etc.). In some embodiments, camera system 102 may be an optically-based system using, for example, a plurality of fixed cameras. For example, a system of six stationary, calibrated cameras, which project the three-dimensional locations of players and the ball onto a two-dimensional overhead view of the court may be used. In another example, a mix of stationary and non-stationary cameras may be used to capture motions of all agents on the playing surface as well as one or more objects of relevance. As those skilled in the art recognize, utilization of such camera system (e.g., camera system 102) may result in many different camera views of the court (e.g., high sideline view, free-throw line view, huddle view, face-off view, end zone view, etc.). Generally, camera system 102 may be utilized for the broadcast feed of a given match. Each frame of the broadcast feed may be stored in a game file 110.

Camera system 102 may be configured to communicate with organization computing system 104 via network 105. Organization computing system 104 may be configured to manage and analyze the broadcast feed captured by camera system 102. Organization computing system 104 may include at least a web client application server 114, pre-processing engine 116, a data store 118, and a camera calibrator 120. Pre-processing engine 116 and camera calibrator 120 may include one or more software modules. The one or more software modules may be collections of code or instructions stored on a media (e.g., memory of organization computing system 104) that represent a series of machine instructions (e.g., program code) that implements one or more algorithmic steps. Such machine instructions may be the actual computer code the processor of organization computing system 104 interprets to implement the instructions or, alternatively, may be a higher level of coding of the instructions that is interpreted to obtain the actual computer code. The one or more software modules may also include one or more hardware components. One or more aspects of an example algorithm may be performed by the hardware components (e.g., circuitry) itself, rather as a result of the instructions.

Data store 118 may be configured to store one or more game files 124. Each game file 124 may include the broadcast data of a given match. For example, the broadcast data may be a plurality of video frames captured by camera system 102.

Camera calibrator 120 may be configured to calibrate the cameras of camera system 102. For example, camera calibrator 120 may be configured to project players detected in the trackable frames to real world coordinates for further analysis. Because cameras in camera systems 102 are constantly moving in order to focus on the ball or key plays, such cameras are unable to be pre-calibrated. Camera calibrator 120 may be configured to generate a homography matrix that can register a target ground-plane surface of any frame from the broadcast video with a top view field model. For example, camera calibrator 120 may implement a single neural network to find a homograph matrix H that can register the target ground-plane surface of any frame I from a broadcast video with a top view field model M. In some embodiments, the standard objective function for computing homography with point correspondence may be:

$H = {\arg{\min\limits_{H}{\frac{1}{\chi }{\sum\limits_{({x_{i}^{\prime},x_{{i)}\epsilon\;\chi}}}{{{H\; x_{i}^{\prime}} - x_{i}}}_{2}}}}}$

where x_(i) represents the (x, y) location of pixel i in the broadcast image I and x_(i)′ is the corresponding pixel location on the model “image” M and χ represents a set of point correspondences between the two images I and M.

Client device 108 may be in communication with organization computing system 104 via network 105. Client device 108 may be operated by a user. For example, client device 108 may be a mobile device, a tablet, a desktop computer, or any computing system having the capabilities described herein. Users may include, but are not limited to, individuals such as, for example, subscribers, clients, prospective clients, or customers of an entity associated with organization computing system 104, such as individuals who have obtained, will obtain, or may obtain a product, service, or consultation from an entity associated with organization computing system 104.

Client device 108 may include at least application 132. Application 132 may be representative of a web browser that allows access to a website or a stand-alone application. Client device 108 may access application 132 to access one or more functionalities of organization computing system 104. Client device 108 may communicate over network 105 to request a webpage, for example, from web client application server 114 of organization computing system 104. For example, client device 108 may be configured to execute application 132 to access content managed by web client application server 114. The content that is displayed to client device 108 may be transmitted from web client application server 114 to client device 108, and subsequently processed by application 132 for display through a graphical user interface (GUI) of client device 108.

FIGS. 2A-2B are block diagrams illustrating neural network architecture 200 of camera calibrator 120, according to example embodiments. As discussed, camera calibrator 120 may utilize a single neural network, which takes in a video frame as input, and outputs a homography matrix of that frame. For example, camera calibrator 120 may utilize a single neural network for a single moving camera calibration given unknown camera internal parameters across a variety of sports (e.g., basketball, soccer, football, hockey, etc.). Neural network architecture 200 may include three modules: semantic segmentation module 202, camera pose initialization module 204, and homography refinement module 206. Each of the three modules 202-206 are integrated into a single neural network architecture, such as that shown by neural network architecture 200. Because all three module 202-206 are connected, neural network architecture 200 is capable of end-to-end training.

Semantic segmentation module 202 may be configured to identify features of the playing surface (e.g., basketball court, soccer field, etc.). For example, semantic segmentation module 202 may be configured to extract key features and remove irrelevant information from an input image, I (reference numeral 220). Such output may result in a venue agnostic appearance Y (reference numeral 222) that may be used to determine the point correspondences. Thus, the objective function H from above may be rewritten as:

$\theta_{H} = {\arg{\min\limits_{\theta_{H}}{L\left( {\overset{\_}{Y},\ {W\left( {M;\theta_{H}} \right)}} \right)}}}$

where θ_(H) represents a vector of the eight homography parameters, W(; θ) represents the warping function with transform parameters θ, and L( ) represents any loss function that measures the difference between two images, in this case the predicted semantic map Y and the warped overhead model M.

Semantic segmentation module 202 may conduct area-based segmentation on a playing surface by dividing the playing surface into one or more regions. By dividing the playing surface into one or more regions, semantic segmentation module 202 may transform the overhead field model M into a multi-channel image. Given the multi-channel image, semantic segmentation module 202 may classify each pixel in I into one region of the one or more regions. To generate area-based semantic labels of each image, semantic segmentation module 202 may warp the overhead model with the associated ground truth homography, thus providing ground truth semantic labels for training.

FIG. 3 is a block diagram illustrating one or more images 302-306 of a basketball playing surface, according to example embodiments. As shown, image 302 may correspond to a top-down view field model for a basketball playing surface. Semantic segmentation module 202 may divide the basketball playing surface into four regions, resulting in a 4-chanel image. For example, region 308 may correspond to a first channel, region 310 correspond to a second channel, region 312 may correspond to a third channel, and region 314 may correspond to a fourth channel. In operation, semantic segmentation module 202 may utilize image 302 to classify each pixel in an input image (e.g., in I) into one of regions 308-314.

Image 304 may illustrate semantic labels applied to an incoming image. Semantic segmentation module 202 may generate image 304 by warping the field model M (e.g., image 302) using the ground truth homography. These images (e.g., image 302 and image 304) may then be used to train semantic segmentation module 202.

Image 306 may illustrate a polygonal area of image 304 from a top-down perspective, illustrating the fraction of the field model in the camera view.

Referring back to FIGS. 2A and 2B, for the segmentation task, semantic segmentation module 202 may implement a Unet style auto-encoder 214 (hereinafter “Unet 214”). Unet 214 may take, as input, image I 220 and output a semantic map Y 222 as needed by θ_(H). In some embodiments, cross-entropy loss may be used to train Unet 214. For example:

$\mathcal{L}_{ce} = {{- \frac{1}{{\overset{\_}{Y}}{C}}}{\sum\limits_{y_{t}^{- c} \in \overset{¯}{Y}}{\sum\limits_{c \in C}{y_{i}^{c}\log y_{i}^{- c}}}}}$

where C may represent the set of classes, and y_(i) ^(c) may represent the ground truth label, and y_(i) ^(−c) may represent the likelihood of pixel i belonging to class c.

Camera pose initialization module 204 may be configured to select an appropriate template from a set of templates using a semantic map. Camera pose initialization module 204 may use a Siamese network to determine the best template for each input semantic image. Siamese network may be a convolutional encoder that computes a hidden representation for a semantic image, which may be the output of Unet 214 or any semantic template image. In some embodiments, the similarity between two images may be the L₂ norm between their hidden representations. In some embodiments, each image may be encoded to a 128-length vector for similarity calculation.

For a PTZ camera, the projective matrix P may be expressed as:

P=KR[I|−C]=KQS[I|−C]

where Q and S are decomposed from rotation matrix R, K are the intrinsic parameters of a camera in camera system 102, I is a 3×3 identity matrix, and C is the camera translation. The matrix S may describe the rotation from the world coordinate to the PTZ camera base, and Q represents the camera rotation due to pan and tilt. For example, S may be defined to rotate around world x-axis by about −90° so that the camera looks along the y-axis in the world plane. In other words, the camera is level and its projection is parallel to the ground.

In some embodiments, for each image, camera calibrator 120 may assume a center principle point, square pixels, and no lens distortion. In some embodiments, six parameters may be identified. For example, the six parameters may be the focal length, three-dimensional camera location, pan and tilt angles.

In some embodiments, pre-processing engine 116 may initialize intrinsic camera matrix K, camera location C, and rotation matrix R. With this initialization, pre-processing engine 116 may identify the optimal focal length, three-dimensional camera location, and rotation angles. For example, pre-processing engine 116 may use the Levenberg-Marquardt algorithm to find the optimal focal length, three-dimensional camera location, and rotation angles. Once pre-processing engine 116 determines K, C, R, and S, pre-processing engine 116 may generate Q. In some embodiments, pre-processing engine 116 may generate the pan and tilt angles given Q. For example, pre-processing engine 116 may generate the pan and tile angles by applied the Rodrigues formula to Q. Thus, from the above, camera pose initialization module 204 may generate the 6-dimensional camera configuration (pan, tilt, zoom, and three-dimensional camera location), A.

After pre-processing engine 116 estimates the camera configuration A for each training image, pre-processing engine 116 may generate a dictionary of possible camera poses A.

In some embodiments, pre-processing engine 116 may generate the dictionary of possible camera poses A by uniformly sampling from the range of possible camera poses. For example, pre-processing engine 116 may determine the ranges of pan, tilt, focal length, and camera location from training data and uniformly sample the poses from a 6-dimensional grid. Such method is able to cover all camera poses, even if the training set is small. Further, using a smaller grid may simplify the homography refinement since the maximum scale of the transformation needed is on the scale of the grid size.

In some embodiments, pre-processing engine 116 can learn the possible camera poses A directly from the training data using clustering. Such process may be beneficial, for example, when the training set has sufficient diversity. For example, pre-processing engine 116 may treat A as a multi-variant normal distribution and apply a Gaussian Mixture model (GMM) to build the camera pose set. In some embodiments, mixing weights π may be fixed as equal for each component. In some embodiments, covariance matrix Σ may be fixed for each distribution. In such embodiments, the characteristic scale of Σ may set the scale of the transformations that are handled by homography refinement module 206. In contrast with traditional GMMs, instead of setting the number of components K, the GMM learning algorithm implemented by pre-processing engine 116 may find the number of components K and the mean μ_(k) of each distribution given the mixing weights π and covariance matrix Σ. Identical Σ and π for each component may ensure that the GMM components are sampled uniformly from the manifold of the training data.

In some embodiments, the GMM learning algorithm may be:

  Pre-define covariance Σ for K = [100, 110, 120, . . . N] do  Initialize μ_(k) for K GMM components  while μ_(k) not converge do    ${Compute}\mspace{14mu}{{\gamma_{k}\left( \lambda_{n} \right)} = \frac{\pi_{k}{\mathcal{N}\left( {{\lambda_{n};\mu_{k}},\Sigma} \right)}}{\Sigma_{j}\pi_{k}{\mathcal{N}\left( {{\lambda_{n};\mu_{k}},\Sigma} \right)}}}$    ${Update}\mspace{14mu}{\mu_{k} = \frac{\Sigma_{n}{\gamma_{k}\left( \lambda_{n} \right)}\lambda_{n}}{\Sigma_{n}{\gamma_{k}\left( \lambda_{n} \right)}}}$  end while   ${{if}\mspace{14mu}\frac{1}{N}\Sigma_{n}\;{\max\limits_{k}\frac{\mathcal{N}\left( {{\lambda_{n};\mu_{k}},\Sigma} \right)}{\mathcal{N}\left( {{\mu_{k};\mu_{k}},\Sigma} \right)}}} > {{threshold}\mspace{14mu}{then}}$   break  end if end for Return GMM

Because pre-processing engine 116 may fix Σ, camera pose initialization module may only update μ during the maximization step. Pre-processing engine 116 may gradually increase K until the stopping criteria are satisfied. The stopping criteria may aim to generate enough components so that every training example is close to the mean of one component in the mixture. Pre-processing engine 116 may generate the camera pose dictionary Λ utilizing all components [μ₁, . . . , μ_(k)].

Given the dictionary of camera poses Λ, camera pose initialization module 204 may compute the homography for each pose and use the A to warp the overhead field model M. Accordingly, a set of image templates

=[T₁, . . . , T_(k)] and their corresponding homography matrices

*=[H₁*, . . . , H_(K)*] may be determined and used camera pose initialization module 204.

Given the semantic segmentation image Y and a set of template images

, camera pose initialization module 204 may use a Siamese network to computer the distance between each input and template pair (Y, T_(k)). In some embodiments, the target/label for each pair may be similar or dissimilar. For example, for a grid sampled camera pose dictionary, a template T_(k) may be similar to the image if its pose parameters are the nearest neighbor in the grid. For the GMM-based camera pose dictionary, a template T_(k) may be labeled as similar to an image if the corresponding distribution of the template

(; μ_(k), Σ) gives the highest likelihood to the pose parameters λ of the input image. This procedure may generate a template similarity label for every image in the training set.

Once the input semantic image Y and the template images

are encoded (after FC1), camera pose initialization module 204 may use the latent representations to compute the L2 distance between the input image and each template. A selection module 210 may find the target camera pose index k and may retrieve its template image T _(k) and homography H _(k) * as output according to:

$\overset{¯}{k} = {\arg{\min\limits_{k}\left\lceil {{f\left( \overset{\_}{Y} \right)} - {f\left( T_{k} \right)}} \right._{2}}}$

where f( ) may represent the encoding function of the Siamese network.

In some embodiments, camera pose initialization module 204 may use contrastive loss to train the Siamese network. For example,

_(con) =a|f( Y )−f(T _(k))₂ ²+(1−a)max(0,m−|f( Y )−f(T _(k))|₂ ²)

where a may represent the binary similarity label for the image pair (Y, T_(k)) and m may represent the margin for contrastive loss.

Homography segmentation module 206 may be configured to refine the homography be identifying the relative transform between the selected template and the input image. For example, homography segmentation module 206 may implement a spatial transformer network (STN) that allows for the handling of large non-affine transformation and use of a smaller camera pose dictionary. For example, given the input image and a selected template, the two images may be stacked and provided as input to STN. STN may be used to regress the geometric transformation parameters. In some embodiments, residual blocks may be used in convolutional encoder to preserve the salient features for deformation prediction. In some embodiments, ReLU may be used for all hidden layers, while the output layer of STN may use a linear activation.

To compute the relative transform between input semantic image Y and the selected template image T _(k) , homography segmentation module 206 may stack the images into an n-channel image (e.g., 8-channel image), forming the input to the localization layers of the STN. In some embodiments, the output of the localization layers may be the parameters (e.g., 8-parameters) of the relative homography H that maps the semantic image Y to the template T_(k).

In some embodiments, homography segmentation module 206 may initialize the last of the localization layers (e.g., FC3), such that all elements in the kernel are zero and the bias is to the first n values (e.g., 8 values) of a flattened identity matrix. Therefore, at the start of the training, the input may be assumed to be identical to the template, providing an initialization for the STN optimization. Therefore, the final homography may be H=H _(k) *H.

Once H is computed, transformer 212 of homography refinement module 206 may warp the overhead model M to the camera perspective or vice versa, which allows camera calibrator 120 to compute the loss function. For example, homography refinement module 206 may us a Dice coefficient loss:

${Dice}{\left( {U,\ V} \right) = {\frac{1}{C}{\sum\limits_{c \in c}\frac{2{{U^{c} \circ V^{c}}}}{{U^{c}} + {V^{c}}}}}}$

where U, V may represent semantic images, C may represent the number of channels, ∘ may represent the element-wise multiplication, and ∥⋅∥ may represent the sum of pixel intensity in an image. Here, for example, the intensity of each channel may be the likelihood that the pixel belongs to a channel c. One of the major advantages of using area-based segmentation, as opposed to line-based segmentation, is that it is robust to occlusions and makes better use (i.e., more efficient use) of the network capacity because a larger fraction of image pixels may belong to a meaningful class.

A limitation, however, of intersection-of-union (IoU) based loss is that as the fraction of the field of view in the image decreases, the IoU loss may become sensitive to segmentation errors. For example, if the playing surface occupied a tiny portion of the image, a small transform could reduce the IoU dramatically. Therefore, homography refinement module 206 uses the Dice loss on the warped playing surface in both perspectives—a high occupancy perspective can achieve coarse registration, while a low occupancy perspective can provide strong constraints on fine-tuning. Thus, the loss functions may be defined as:

_(warp)=δDice(Y,

(M,θ _(H)))+(1−δ)Dice(M′,

(Y,θ _(H) ⁻¹ ))

where Y may represent the ground truth semantic image and M′ may represent the masked overhead field model so that loss is only computed for the area shown in the image. Losses from the two perspectives may be weighted by δ, where the weight for the lower occupancy fraction perspective is always higher.

Because each module 202-206 may use the output of other modules as input, the three modules 202-206 may be connected into a single neural network (i.e., neural network architecture 200). As such, the total loss of the network may become:

=α

_(ce)+β

_(con)+(1−α−β)

_(warp)

where α,β∈[0,1).

Camera calibrator 120 may train the entire neural network architecture 200 incrementally, module-by-module, so that the Siamese network and STN may start training with reasonable inputs. For example, training may start with a 20-epoch warm-up for the Unet; the Siamese network training may be turned on with a α=0.1 and β=0.9. After another 10 epochs, for example, the STN may be turned on with α=0.05 and β=0.05. Neural network architecture may continue to undergo join training until convergence.

FIG. 4 is a flow diagram illustrating a method 400 of generating a fully trained calibration model, according to example embodiments. Method 400 may begin at step 402.

At step 402, organization computing system 104 may retrieve one or more data sets for training. Each data set may include a plurality of images captured by a camera system 102 during the course of a game.

In some embodiments, the data set may be created from thirteen basketball games. Those skilled in the art recognize that more than thirteen games or less than thirteen games may be used for training purposes. For example, ten games may be used for training and the remaining three games may be used for testing. Those killed in the art recognize that more than ten games or less than ten games may be used for training and more than three games or less than three games may be used for testing. The aforementioned number of games for training purposes is exemplary only and is not meant to limit the foregoing discussion. Different games may have different camera locations, with each game being played in a unique venue. As such, the playing surface appearance for each game may be very different from game-to-game. For each game, 30-60 frames may be selected for each annotation with a high camera pose diversity. Professional annotators may have clicked four to six point correspondences in each image to compute the ground truth homography. These annotations may have produced 526 images for training and 114 images for testing. In some embodiments, the training data may be further enriched by flipping the images horizontally, which may generate 1052 training examples in total.

In some embodiments, the data set may be created from twenty soccer games. For example, the twenty soccer games were held in nine different stadiums during day and night, and the images may consist of different perspectives and lighting conditions. Accordingly, the data set may include 209 training images collected from 10 games and 186 testing images collected from the other 10 games.

At step 404, organization computing system 104 may generate a plurality of camera pose templates from the one or more data sets. For example, based on the retrieved one or more data sets for training, camera calibrator 120 may generate camera pose templates for training. In some embodiments, camera calibrator 120 may generate the camera pose templates using the GMM-based method discussed above, provided that the one or more data sets is adequately large and diverse. In some embodiments, one or more data sets may be considered adequately large and diverse when a complete and relatively clean overhead playing surface image is achieved. In such embodiments, camera calibrator 120 may set the standard deviation for pan, tilt, focal length, and camera locations (x, y, z). In some embodiments, camera calibrator 120 may further set the threshold for stopping criteria and warping loss,

_(warp)δ.

Continuing with the first example referenced above, using the basketball data set, camera calibrator 120 may use the GMM-based method to generate camera pose templates from 1052 training images. In such example, camera calibrator 120 may set the standard deviation for pan, tilt, focal length, and camera locations (x, y, z) to 5°, 5°, 1000 pixels, and 15 feet respectively. The non-diagonal elements may be set to zero, as camera calibrator 120 assumes that those camera configurations are independent of each other. The threshold for the stopping criteria may be set to 0.6 and the clustering algorithm may generate 210 components. For the warping loss,

_(warp)δ may be set to 0.8 because the camera perspective may have a lower field occupancy rate than the top view perspective.

In some embodiments, camera calibrator 120 may generate the camera pose templates using a high grid resolution if, for example, the one or more data sets has an insufficient number of examples. In such embodiments, camera calibrator 120 may set the resolution of pan, tilt, and focal length.

Continuing with the second example referenced above, using the soccer data set, camera calibrator 120 may use a high grid resolution approach to generate the camera pose templates. In such examples, camera calibrator 120 may set the resolution of pan, tilt, and focal length to 5°, 2.5°, and 500 pixels, respectively. In some embodiments, the camera locations may be fixed at, for example, 560, 1150, and 186, yards relative to the top left corner of the field. Because the soccer data set has an insufficient number of examples to use the GMM-based camera pose estimation, camera calibrator 120 may use a uniform sampling for this data set with estimated pan, tilt, and focal length range ([−35°, 35° ], [5°, 15° ], [1500, 4500] pixels respectively), which generates 450 templates for camera pose initialization.

As those skilled in the art recognize, although basketball and soccer are discussed in the current examples, such methodologies may be extended to the video broadcast of any sport.

At step 406, organization computing system 104 may learn, based on the one or more training data sets, how to calibrate a single moving camera. For example, neural network of camera calibrator 120 may learn how to calibrate a single moving camera based on the one or more training data sets. In some embodiments, each module of neural network architecture 200 may be trained simultaneously. For example, because each module 202-206 of neural network architecture 200 uses the output of other modules as input, the three modules 202-206 may be connected into a single neural network. As such, the total loss of the network may become:

=α

_(ce)+β

_(con)+(1−α−β)

_(warp)

where α,β∈[0,1).

Camera calibrator 120 may train the entire neural network architecture 200 incrementally, module-by-module, so that the Siamese network and STN may start training with reasonable inputs. For example, training may start with a 20-epoch warm-up for the Unet; the Siamese network training may be turned on with a α=0.1 and β=0.9. After another 10 epochs, for example, the STN may be turned on with α=0.05 and β=0.05. Neural network architecture may continue to undergo join training until convergence.

In some embodiments, one or more modules of modules 202-206 may be “warmed up” with synthesized data. For example, due to the small number of training examples in the above referenced soccer data sets, camera calibrator 120 may use synthesized data to warm up camera pose initialization module 204 and homography refinement module 206. Apart from Unet in semantic segmentation module 202, the rest of neural network architecture 200 uses the semantic images as input so that camera calibrator 120 can synthesize an arbitrary number of semantic images to pre-train parts of the network. Using a specific example, 2000 semantic images may be generated by uniformly sampling the pan, tilt, and focal length parameters. For each synthesized image, their ground truth homography is known, and the template assignment can be easily found by down sampling the grid. Thus, camera pose initialization module 204 and the STN may be pre-trained individually. Once camera pose initialization module 204 and homography refinement module 206 are warmed up, camera calibrator 120 may train neural network with real data.

At step 408, organization computing system 104 may output a fully trained prediction model. For example, at the end of the training and testing processes, camera calibrator 120 may have a fully trained neural network architecture 200.

FIG. 5 is a flow diagram illustrating a method 500 of calibrating a broadcast camera, according to example embodiments. Method 500 may begin at step 502.

At step 502, organization computing system 104 may receive (or retrieve) a broadcast feed for an event. In some embodiments, the broadcast feed may be a live feed received in real-time (or near real-time) from camera system 102. In some embodiments, the broadcast feed may be a broadcast feed of a game that has concluded. Generally, the broadcast feed may include a plurality of frames of video data. Each frame may capture a different camera perspective.

At step 504, organization computing system 104 may input each frame into neural network architecture 200. For example, camera calibrator 120 may identify a first frame in a received broadcast feed and provide that frame to neural network architecture 200.

At step 506, organization computing system 104 may generate a homography matrix H for each frame. For example, semantic segmentation module 202 may identify the court features Y in each frame. The output from semantic segmentation module 202 may be the semantic map Y generated by the Unet. The semantic map Y may be provided as input to camera pose initialization module 204. Camera pose initialization module 204 may select the appropriate template T _(k) from a set of templates using semantic map Y. Camera pose initialization module 204 may further identify the target camera pose index k and retrieve its template image T _(k) and homography H _(k) * using selection module 210. Camera calibrator 120 may pass, as input to homography refinement module 206, both T _(k) and Y concatenated and H _(k) *. Homography refinement module 206 may then predict the relative homography H between the template and the semantic map by passing the concatenated item T _(k) and Y to the STN. Homography refinement module 206 may then generate the homography matrix H based on the relative homography H and H _(k) * using matrix multiplication, i.e., H=HH _(k) *.

At step 508, organization computing system 104 may warp each frame by its respective homography matrix H.

FIG. 6A illustrates a system bus computing system architecture 600, according to example embodiments. System 600 may be representative of at least a portion of organization computing system 104. One or more components of system 600 may be in electrical communication with each other using a bus 605. System 600 may include a processing unit (CPU or processor) 610 and a system bus 605 that couples various system components including the system memory 615, such as read only memory (ROM) 620 and random access memory (RAM) 625, to processor 610. System 600 may include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of processor 610. System 600 may copy data from memory 615 and/or storage device 630 to cache 612 for quick access by processor 610. In this way, cache 612 may provide a performance boost that avoids processor 610 delays while waiting for data. These and other modules may control or be configured to control processor 610 to perform various actions. Other system memory 615 may be available for use as well. Memory 615 may include multiple different types of memory with different performance characteristics. Processor 610 may include any general purpose processor and a hardware module or software module, such as service 1 632, service 2 634, and service 3 636 stored in storage device 630, configured to control processor 610 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. Processor 610 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.

To enable user interaction with the computing device 600, an input device 645 may represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 635 may also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems may enable a user to provide multiple types of input to communicate with computing device 600. Communications interface 640 may generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.

Storage device 630 may be a non-volatile memory and may be a hard disk or other types of computer readable media which may store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 625, read only memory (ROM) 620, and hybrids thereof.

Storage device 630 may include services 632, 634, and 636 for controlling the processor 610. Other hardware or software modules are contemplated. Storage device 630 may be connected to system bus 605. In one aspect, a hardware module that performs a particular function may include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as processor 610, bus 605, display 635, and so forth, to carry out the function.

FIG. 6B illustrates a computer system 650 having a chipset architecture that may represent at least a portion of organization computing system 104. Computer system 650 may be an example of computer hardware, software, and firmware that may be used to implement the disclosed technology. System 650 may include a processor 655, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor 655 may communicate with a chipset 660 that may control input to and output from processor 655. In this example, chipset 660 outputs information to output 665, such as a display, and may read and write information to storage device 670, which may include magnetic media, and solid state media, for example. Chipset 660 may also read data from and write data to RAM 675. A bridge 680 for interfacing with a variety of user interface components 685 may be provided for interfacing with chipset 660. Such user interface components 685 may include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system 650 may come from any of a variety of sources, machine generated and/or human generated.

Chipset 660 may also interface with one or more communication interfaces 690 that may have different physical interfaces. Such communication interfaces may include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein may include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 655 analyzing data stored in storage 670 or 675. Further, the machine may receive inputs from a user through user interface components 685 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 655.

It may be appreciated that example systems 600 and 650 may have more than one processor 610 or be part of a group or cluster of computing devices networked together to provide greater processing capability.

While the foregoing is directed to embodiments described herein, other and further embodiments may be devised without departing from the basic scope thereof. For example, aspects of the present disclosure may be implemented in hardware or software or a combination of hardware and software. One embodiment described herein may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and can be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory (ROM) devices within a computer, such as CD-ROM disks readably by a CD-ROM drive, flash memory, ROM chips, or any type of solid-state non-volatile memory) on which information is permanently stored; and (ii) writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive or any type of solid state random-access memory) on which alterable information is stored. Such computer-readable storage media, when carrying computer-readable instructions that direct the functions of the disclosed embodiments, are embodiments of the present disclosure.

It will be appreciated to those skilled in the art that the preceding examples are exemplary and not limiting. It is intended that all permutations, enhancements, equivalents, and improvements thereto are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present disclosure. It is therefore intended that the following appended claims include all such modifications, permutations, and equivalents as fall within the true spirit and scope of these teachings. 

1. A method of calibrating a broadcast video feed, comprising: retrieving, by a computing system, a plurality of broadcast video feeds for a plurality of sporting events, each broadcast video feed comprising a plurality of video frames; generating, by the computing system, a trained neural network, by: generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames; and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames; receiving, by the computing system, a target broadcast video feed for a target sporting event; partitioning, by the computing system, the target broadcast video feed into a plurality of target frames; for each target frame in the plurality of target frames, generating, by the neural network, a target homography matrix; and calibrating, by the computing system, the target broadcast video feed by warping each target frame by a respective target homography matrix.
 2. The method of claim 1, wherein the neural network comprises: a semantic segmentation module; a camera pose initialization module; and homography refinement module.
 3. The method of claim 2, wherein learning, by the neural network, to generate a homography matrix comprises: learning, by the semantic segmentation module, to generate a venue agnostic appearance for each frame of the plurality of frames.
 4. The method of claim 3, further comprising: learning, by the camera pose initialization module, to compute a distance between each input received from the semantic segmentation module and a set of template images; and learning, by the camera pose initialization module, to identify a template homography matrix associated with the semantic segmentation module and the set of template images.
 5. The method of claim 4, further comprising: learning, by the homography refinement module, to generate a relative homography matrix based on a concatenated input comprising the venue agnostic appearance for each frame and a template image; and learning, by the homography refinement module, to generate the homography matrix based on the relative homography matrix and the template homography matrix.
 6. The method of claim 5, wherein each of the semantic segmentation module, the camera pose initialization module, and the homography refinement module are trained simultaneously.
 7. The method of claim 1, wherein for each target frame in the plurality of target frames, generating, by the neural network, the target homography matrix comprises: generating a playing surface agnostic view of a playing surface in each target frame; identifying a template that most closely matches the playing surface agnostic view of the playing surface; retrieving a template homography matrix associated with the template; predicting a relative homography matrix based on the identified template and the playing surface agnostic view; and generating the target homography matrix based on the template homography matrix and the relative homography matrix.
 8. A system for calibrating a broadcast video feed, comprising: a processor; and a memory having programming instructions stored thereon, which, when executed by the processor, performs one or more operations, comprising: retrieving a plurality of broadcast video feeds for a plurality of sporting events, each broadcast video feed comprising a plurality of video frames; generating a trained neural network, by: generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames; and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames; receiving a target broadcast video feed for a target sporting event; partitioning the target broadcast video feed into a plurality of target frames; for each target frame in the plurality of target frames, generating, by the neural network, a target homography matrix; and calibrating the target broadcast video feed by warping each target frame by a respective target homography matrix.
 9. The system of claim 8, wherein the neural network comprises: a semantic segmentation module; a camera pose initialization module; and homography refinement module.
 10. The system of claim 9, wherein learning, by the neural network, to generate a homography matrix comprises: learning, by the semantic segmentation module, to generate a venue agnostic appearance for each frame of the plurality of frames.
 11. The system of claim 10, further comprising: learning, by the camera pose initialization module, to compute a distance between each input received from the semantic segmentation module and a set of template images; and learning, by the camera pose initialization module, to identify a template homography matrix associated with the semantic segmentation module and the set of template images.
 12. The system of claim 11, further comprising: learning, by the homography refinement module, to generate a relative homography matrix based on a concatenated input comprising the venue agnostic appearance for each frame and a template image; and learning, by the homography refinement module, to generate the homography matrix based on the relative homography matrix and the template homography matrix.
 13. The system of claim 12, wherein each of the semantic segmentation module, the camera pose initialization module, and the homography refinement module are trained simultaneously.
 14. The system of claim 8, wherein for each target frame in the plurality of target frames, generating, by the neural network, the target homography matrix comprises: generating a playing surface agnostic view of a playing surface in each target frame; identifying a template that most closely matches the playing surface agnostic view of the playing surface; retrieving a template homography matrix associated with the template; predicting a relative homography matrix based on the identified template and the playing surface agnostic view; and generating the target homography matrix based on the template homography matrix and the relative homography matrix.
 15. A non-transitory computer readable medium including one or more sequences of instructions that, when executed by one or more processors, causes: retrieving, by a computing system, a plurality of broadcast video feeds for a plurality of sporting events, each broadcast video feed comprising a plurality of video frames; generating, by the computing system, a trained neural network, by: generating a plurality of training data sets based on the broadcast video feed by partitioning the broadcast video feed into a plurality of frames; and learning, by the neural network, to generate a homography matrix for each frame of the plurality of frames; receiving, by the computing system, a target broadcast video feed for a target sporting event; partitioning, by the computing system, the target broadcast video feed into a plurality of target frames; for each target frame in the plurality of target frames, generating, by the neural network, a target homography matrix; and calibrating, by the computing system, the target broadcast video feed by warping each target frame by a respective target homography matrix.
 16. The non-transitory computer readable medium of claim 15, wherein the neural network comprises: a semantic segmentation module; a camera pose initialization module; and homography refinement module.
 17. The non-transitory computer readable medium of claim 16, wherein learning, by the neural network, to generate a homography matrix comprises: learning, by the semantic segmentation module, to generate a venue agnostic appearance for each frame of the plurality of frames.
 18. The non-transitory computer readable medium of claim 17, further comprising: learning, by the camera pose initialization module, to compute a distance between each input received from the semantic segmentation module and a set of template images; and learning, by the camera pose initialization module, to identify a template homography matrix associated with the semantic segmentation module and the set of template images.
 19. The non-transitory computer readable medium of claim 18, further comprising: learning, by the homography refinement module, to generate a relative homography matrix based on a concatenated input comprising the venue agnostic appearance for each frame and a template image; and learning, by the homography refinement module, to generate the homography matrix based on the relative homography matrix and the template homography matrix.
 20. The non-transitory computer readable medium of claim 15, wherein for each target frame in the plurality of target frames, generating, by the neural network, the target homography matrix comprises: generating a playing surface agnostic view of a playing surface in each target frame; identifying a template that most closely matches the playing surface agnostic view of the playing surface; retrieving a template homography matrix associated with the template; predicting a relative homography matrix based on the identified template and the playing surface agnostic view; and generating the target homography matrix based on the template homography matrix and the relative homography matrix. 